Genetic Code Degeneracy: Implications for Grammatical Evolution and Beyond
نویسنده
چکیده
Grammatical Evolution (GE) is a grammar-based GA which generates computer programs. GE has the distinction that its input is a BNF, which permits it to generate programs in any language, of arbitrary complexity. Part of the power of GE is that it is closer to natural DNA than other Evolutionary Algorithms, and thus can beneet from natural phenomena such as a separation of search and solution spaces through a genotype to phenotype mapping, and a genetic code degeneracy which can give rise to silent mutations that have no eeect on the phenotype. It has previously been shown how runs of GE are competitive with GP, and in this paper we analyse the feature of genetic code degeneracy, and its implications for genotypic diversity. Results show that genetic diversity is improved as a result of degeneracy in the genetic code for the problem domains addressed here.
منابع مشابه
Grammar Defined Introns: An Investigation Into Grammars, Introns, and Bias in Grammatical Evolution
We describe an investigation into the design of different grammars on Grammatical Evolution. As part of this investigation we introduce introns using the grammar as a mechanism by which they may be incorporated into Grammatical Evolution. We establish that a bias exists towards certain production rules for each non-terminal in the grammar, and propose alternative mechanisms by which this bias m...
متن کاملAutomatic Generation of Programs with Grammatical Evolution
Grammatical Evolution (GE) is a grammar based Evolutionary Algorithm to generate computer programs which has been shown to be competitive with Genetic Programming when applied to a diverse array of problems. GE has the distinction that its input is a BNF, which permits it to generate arbitrarily complex programs in any language, including loops, multiple line functions etc. Part of the power of...
متن کاملUnder the Hood of Grammatical Evolution
Grammatical Evolution (GE) is a grammar based GA to generate computer programs which has been shown to be comparable with GP when applied to a diverse array of problems. GE has the distinction that its input is a BNF, which permits it to generate programs in any language, of arbitrary complexity, including loops, multiple line functions etc. Part of the power of GE is that it is closer to natur...
متن کاملAutomatic Programming with Grammatical Evolution
The aim of this work is to develop an Automatic Programming system drawing inspiration from biological genetic systems. Grammatical Evolution (GE), a system which can generate code in any language from variable length binary strings is the result of this investigation. Using a language definition in the form of a Backus Naur Form grammar permits the generation of programs in any language, of ar...
متن کاملAutomatic Generation of High Level Functions using Evolutionary Algorithms
Evolutionary Algorithms, based upon the Darwinian principle of Natural Selection, have been applied with varying degrees of success to a broad range of problem domains, including the automatic induction of computer programs. This paper describes Grammatical Evolution (GE), an evolutionary algorithm approach to automatic programming, which employs variable length, binary chromosomes. The binary ...
متن کامل